// Copyright (C) Kumo inc. and its affiliates.
// Author: Jeff.li lijippy@163.com
// All rights reserved.
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published
// by the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <https://www.gnu.org/licenses/>.
//


// Adapted from Apache Arrow.

#pragma once

#include <cstdint>

namespace kumo::pollux::parquet {
    /// Builds a  bitmap where each set bit indicates the corresponding level is
    /// greater than rhs.
    uint64_t
    GreaterThanBitmap(const int16_t *levels, int64_t numLevels, int16_t rhs);

    struct MinMax {
        int16_t min;
        int16_t max;
    };

    MinMax FindMinMax(const int16_t *levels, int64_t numLevels);
} // namespace kumo::pollux::parquet
